منابع مشابه
Push is Fast on Sparse Random Graphs
We consider the classical push broadcast process on a large class of sparse random multigraphs that includes random power law graphs and multigraphs. Our analysis shows that for every ε > 0, whp O(log n) rounds are sufficient to inform all but an ε-fraction of the vertices. It is not hard to see that, e.g. for random power law graphs, the push process needs whp n rounds to inform all vertices. ...
متن کاملFast Recoloring of Sparse Graphs
In this paper, we show that for every graph of maximum average degree bounded away from d, any (d + 1)-coloring can be transformed into any other one within a polynomial number of vertex recolorings so that, at each step, the current coloring is proper. In particular, it implies that we can transform any 8-coloring of a planar graph into any other 8-coloring with a polynomial number of recolori...
متن کاملFast Embedding of Sparse Music Similarity Graphs
This paper applies fast sparse multidimensional scaling (MDS) to a large graph of music similarity, with 267K vertices that represent artists, albums, and tracks; and 3.22M edges that represent similarity between those entities. Once vertices are assigned locations in a Euclidean space, the locations can be used to browse music and to generate playlists. MDS on very large sparse graphs can be e...
متن کاملFast Embedding of Sparse Similarity Graphs
This paper applies fast sparse multidimensional scaling (MDS) to a large graph of music similarity, with 267K vertices that represent artists, albums, and tracks; and 3.22M edges that represent similarity between those entities. Once vertices are assigned locations in a Euclidean space, the locations can be used to browse music and to generate playlists. MDS on very large sparse graphs can be e...
متن کاملFast Generation of Sparse Random Kernel Graphs
The development of kernel-based inhomogeneous random graphs has provided models that are flexible enough to capture many observed characteristics of real networks, and that are also mathematically tractable. We specify a class of inhomogeneous random graph models, called random kernel graphs, that produces sparse graphs with tunable graph properties, and we develop an efficient generation algor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the National Academy of Sciences
سال: 2019
ISSN: 0027-8424,1091-6490
DOI: 10.1073/pnas.1811033116